Constructing Optimal IP Routing Tables
نویسندگان
چکیده
The Border Gateway Protocol (BGP) populates Internet backbone routers with routes or prefixes. We present an algorithm to locally compute (without any modification to BGP) equivalent forwarding tables that provably contain the minimal number of prefixes. For large backbone routers, the Optimal Routing Table Constructor (ORTC) algorithm that we present produces routing tables with roughly 60% of the original number of prefixes. The publicly available MaeEast database with 41315 prefixes reduces to 23007 prefixes when ORTC is applied. We present performance measurements on four publicly available databases and a formal proof that ORTC does produce the optimal set of routes.
منابع مشابه
CONSERT: Constructing optimal name-based routing tables
Name-based routing belongs to a routing category different from address-based routing, it is usually adopted by content-oriented networks [Sharma et al., 2014, Koponen et al., 2007, Rajahalme et al.,2011, Thaler et al.,1998, Hwang et al., 2010, Gritter et al., 2001, Caesar et al., 2006, Carzaniga et al., 2004, Koponen et al., 2007, Hwang et al., 2009 Singla et al., 2010, Detti et al., 2011, Jai...
متن کاملEfficient Construction of Variable-Stride Multibit Tries for IP Lookup
Srinivasan and Varghese [17] have proposed the use of multibit tries to represent routing tables used for Internet (IP) address lookups. They propose an dynamic programing algorithm to determine the strides for an optimal variable-stride trie that has at most levels. Here, is the number of prefixes in the routing table and is the length of the longest prefix. We improve on this algorithm by pro...
متن کاملOptimal Routing Table Design for IP Address Lookups Under Memory Constraints
The design of lookup tables for fast IP address lookup algorithms using a general processor is formalized as an optimization problem. A cost model that models the access times and sizes of the hierarchical memory structure of the processor is formulated. Two algorithms, using dynamic programming and Lagrange multipliers, solve the optimization problem optimally and approximately respectively. E...
متن کاملRouting Bridges (RBridges): Base Protocol Specification
Routing Bridges (RBridges) provide optimal pair-wise forwarding without configuration, safe forwarding even during periods of temporary loops, and support for multipathing of both unicast and multicast traffic. They achieve these goals using IS-IS routing and encapsulation of traffic with a header that includes a hop count. RBridges are compatible with previous IEEE 802.1 customer bridges as we...
متن کاملLoad optimal MPLS routing with N+M labels
MPLS is becoming an important protocol for intradomain routing. MPLS routers are offered by the major vendors and many ISPs are deploying MPLS in their IP backbones, as well as in ATM and Frame Relay networks. For this period of possible transition to MPLS, it is urgent to increase our understanding of the power and limitation of MPLS. An attraction to MPLS is the flexibility it offers in engin...
متن کامل